QMaxSATpb: A Certified MaxSAT Solver

نویسندگان

چکیده

While certification has been successful in the context of satisfiablity solving, with most state-of-the-art solvers now able to provide proofs unsatisfiability, maximum satisfiability, such techniques are not yet widespread. In this paper, we present QMaxSATpb, an extension QMaxSAT that can produce optimality VeriPB proof format, which itself builds on well-known cutting planes system. Our experiments demonstrate logging is possible without much overhead.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inductive Logic Programming Using a MaxSAT Solver

Inductive Logic Programming (ILP) is a method of machine learning which is based on predicate logic. In this work, we propose a new method that transforms a problem of ILP into that of MaxSAT. MaxSAT is an optimization version of SAT. It finds an variable assignment that maximizes the number of satisfied clauses.

متن کامل

LMHS: A SAT-IP Hybrid MaxSAT Solver

We describe LMHS, an open source weighted partial maximum satisfiability (MaxSAT) solver. LMHS is a hybrid SAT-IP MaxSAT solver that implements the implicit hitting set approach to MaxSAT. On top of the main algorithm, LMHS offers integrated preprocessing, solution enumeration, an incremental API, and the use of a choice of SAT and IP solvers. We describe the main features of LMHS, and give emp...

متن کامل

Open-WBO: A Modular MaxSAT Solver,

This paper presents OPEN-WBO, a new MaxSAT solver. OPEN-WBO has two main features. First, it is an open-source solver that can be easily modified and extended. Most MaxSAT solvers are not available in open-source, making it hard to extend and improve current MaxSAT algorithms. Second, OPENWBO may use any MiniSAT-like solver as the underlying SAT solver. As many other MaxSAT solvers, OPEN-WBO re...

متن کامل

Solving MaxSAT by Successive Calls to a SAT Solver

The Maximum Satisfiability (MaxSAT) problem is the problem of finding a truth assignment that maximizes the number of satisfied clauses of a given Boolean formula in Conjunctive Normal Form (CNF). Many exact solvers for MaxSAT have been developed during recent years, and many of them were presented in the well-known SAT conference. Algorithms for MaxSAT generally fall into two categories: (1) b...

متن کامل

SAT-based MaxSAT algorithms

Article history: Received 19 June 2012 Received in revised form 3 January 2013 Accepted 13 January 2013 Available online 21 January 2013

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2022

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-15707-3_33